Axiomatic aggregation of incomplete rankings
نویسندگان
چکیده
منابع مشابه
MRA-based Statistical Learning from Incomplete Rankings
Statistical analysis of rank data describing preferences over small and variable subsets of a potentially large ensemble of items {1, . . . , n} is a very challenging problem. It is motivated by a wide variety of modern applications, such as recommender systems or search engines. However, very few inference methods have been documented in the literature to learn a ranking model from such incomp...
متن کاملAggregation of Rankings in Figure Skating
We scrutinize and compare, from the perspective of modern theory of social choice, two rules that have been used to rank competitors in Figure Skating for the past decades. The first rule has been in use at least from 1982 until 1998, when it was replaced by a new one. We also compare these two rules with the Borda and the Kemeny rules. The four rules are illustrated with examples and with the ...
متن کاملAn axiomatic approach to bibliometric rankings and indices
This paper analyzes several well-known bibliometric indices using an axiomatic approach. We concentrate on indices aiming at capturing the global impact of a scientific output and do not investigate indices aiming at capturing an average impact. Hence, the indices that we study are designed to evaluate authors or groups of authors but not journals. The bibliometric indices that are studied incl...
متن کاملIncomplete Information Aggregation Games
This paper concerns a class of collective decision-making problems under incomplete information. Members of a group receive private signals and the group must take a collective decision—e.g., make a group purchase—based on the aggregate of members’ private information. Since members have diverse preferences over the outcome of this decision, each has an incentive to manipulate the decision-maki...
متن کاملDistributional Rank Aggregation, and an Axiomatic Analysis
The rank aggregation problem has been studied with varying desiderata in varied communities such as Theoretical Computer Science, Statistics, Information Retrieval and Social Welfare Theory. We introduce a variant of this problem we call distributional rank aggregation, where the ranking data is only available via the induced distribution over the set of all permutations. We provide a novel tra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IIE Transactions
سال: 2015
ISSN: 0740-817X,1545-8830
DOI: 10.1080/0740817x.2015.1109737